Hypersphere Fitting From Noisy Data Using an EM Algorithm

نویسندگان

چکیده

This letter studies a new expectation maximization (EM) algorithm to solve the problem of circle, sphere and more generally hypersphere fitting. relies on introduction random latent vectors having priori independent von Mises-Fisher distributions defined hypersphere. statistical model leads complete data likelihood whose expected value, conditioned observed data, has Von distribution. As result, inference can be solved with simple EM algorithm. The performance resulting fitting is evaluated for circle

منابع مشابه

Fitting jump diffusion processes using the EM algorithm

Jump diffusion processes are often used as an alternative to geometric Brownian motion within continuous–time dynamic financial time series models. The advantages of the jump diffusion process are that it can not only account for discrete jumps in the path of the process, but it also provides a simple way of replacing the Gaussian return distributions that arise in geometric Brownian motion mod...

متن کامل

Maximum likelihood estimation from fuzzy data using the EM algorithm

A method is proposed for estimating the parameters in a parametric statistical model when the observations are fuzzy and are assumed to be related to underlying crisp realizations of a random sample. This method is based on maximizing the observeddata likelihood defined as the probability of the fuzzy data. It is shown that the EM algorithm may be used for that purpose, which makes it possible ...

متن کامل

Learning from Noisy Data Using a Non-covering ILP Algorithm

In this paper we describe the non-covering inductive logic programming program HYPER/N, concentrating mainly on noise handling as well as some other mechanisms that improve learning. We perform some experiments with HYPER/N on synthetic weather data with artificially added noise, and on real weather data to learn to predict the movement of rain from radar rain images and synoptic data.

متن کامل

Discrete Polynomial Curve Fitting to Noisy Data

A discrete polynomial curve is defined as a set of points lying between two polynomial curves. This paper deals with the problem of fitting a discrete polynomial curve to given integer points in the presence of outliers. We formulate the problem as a discrete optimization problem in which the number of points included in the discrete polynomial curve, i.e., the number of inliers, is maximized. ...

متن کامل

An EM Estimation Algorithm of Iterated Random Function System Parameters from Noisy Observations

In this paper, a new solution to the inverse problem of iterated random function systems is presented. The solution is based on a generalized hidden Markov model formalism to model the process generated by an iterated random function system. Instead of the assumption of conditional independence of observation sequence elements given the state sequence, the new model assumes the existence of sho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Signal Processing Letters

سال: 2021

ISSN: ['1558-2361', '1070-9908']

DOI: https://doi.org/10.1109/lsp.2021.3051851